Phase transitions in random mixtures of elementary cellular automata
نویسندگان
چکیده
We investigate one-dimensional Probabilistic Cellular Automata, called Diploid Elementary Automata (DECA), obtained as random mixture of two different rules. All the cells are updated synchronously and probability for one cell to be $0$ or $1$ at time $t$ depends only on value same that its neighbors $t-1$. These very simple models show a rich behavior strongly depending choice randomly mixed together parameter which governs probabilistically mixture. In particular, we study existence phase transition whole set possible DECA by mixing null rule associates any local configuration, with other $255$ elementary rule. approach problem analytically via Mean Field approximation use rigorous based application Dobrushin Criterion. The distinguishing trait our result is possibility describe considered without exploiting properties individual models. results find coherent numerical studies already published in scientific literature also some proven specific
منابع مشابه
Phase Transitions in the Computational Complexity of "Elementary'' Cellular Automata
A study of the computational complexity of determining the "Garden-of-Eden" states (i.e., states without any pre-images) of one-dimensional cellular automata (CA) is reported. The work aims to relate phase transitions in the computational complexity of decision problems, with the type of dynamical behavior exhibited by the CA time evolution. This is motivated by the observation of critical beha...
متن کاملAsynchronism Induces Second-Order Phase Transitions in Elementary Cellular Automata
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme consists in applying the rule with a fixed probability, called the synchrony rate. For some particular rules, varying the synchrony rate continuously produces a qu...
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملA Phase Diagram for Elementary Cellular Automata
We construct a phase diagram for the possible dynamics of one-dimensional, two-state, three-neighbor cellular automaton rules, using a new parameter (in conjunction with the previously known activity parameter). The new parameter 'estimates the average sensitivity of rule outcome to small changes in neighborhood configuration.
متن کاملElementary Cellular Automata with Minimal Memory and Random Number Generation
Cellular automata (CA) are discrete, spatially explicit extended dynamic systems. CA systems are composed of adjacent cells or sites arranged as a regular lattice, which evolve in discrete time steps. Each cell is characterized by an internal state whose value belongs to a finite set. The updating of these states is made simultaneously according to a common local transition rule involving a nei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2021
ISSN: ['1872-8022', '0167-2789']
DOI: https://doi.org/10.1016/j.physa.2021.125942